α-Resolution Method for Lattice-valued Horn Generalized Clauses in Lattice-valued Propositional Logic Systems
نویسندگان
چکیده
منابع مشابه
α-Resolution Method for Lattice-valued Horn Generalized Clauses in Lattice-valued Propositional Logic Systems
In this paper, an α-resolution method for a set of lattice-valued Horn generalized clauses is established in lattice-valued propositional logic systemL P(X) based on lattice implication algebra. Firstly, the notions of lattice-valued Horn generalized clause, normal lattice-valued Horn generalized clause and unit latticevalued Horn generalized clause are given in L P(X). Then, the α-resolution o...
متن کاملDetermination of 3-Ary α-Resolution in Lattice-valued Propositional Logic LP(X)
One of key issues for α-n(t) ary resolution automated reasoning based on lattice-valued logic with truthvalue in a lattice implication algebra is to investigate the α-n(t) ary resolution of some generalized literals. In this article, the determination of α-resolution of any 3-ary generalized literals which include the implication operators not more than 2 in LP(X). It not only lay the foundatio...
متن کاملLATTICE-VALUED CATEGORIES OF LATTICE-VALUED CONVERGENCE SPACES
We study L-categories of lattice-valued convergence spaces. Suchcategories are obtained by fuzzifying" the axioms of a lattice-valued convergencespace. We give a natural example, study initial constructions andfunction spaces. Further we look into some L-subcategories. Finally we usethis approach to quantify how close certain lattice-valued convergence spacesare to being lattice-valued topologi...
متن کاملDetermination of α -Resolution for Lattice-Valued First-Order Logic Based on Lattice Implication Algebra
As a continuation of our research work on resolutionbased automated reasoning approaches for latticevalued logic systems with truth-values in a latticevalued logical algebraic structure – lattice implication algebra (LIA), in the present paper, we prove thatα resolution for lattice-valued first-order logic ( ) LF X based on LIA can be equivalently transformed into that for lattice-valued propos...
متن کاملα-Quasi-Lock Semantic Resolution Method Based on Lattice-Valued Logic
Based on the general form of -resolution principle for a lattice-valued logic with truth-values defined in a latticevalued logical algebra structure lattice implication algebra, the further extended -resolution method in this lattice-valued logic is discussed in the present paper in order to increase the efficiency of the resolution method. Firstly, -quasi-lock semantic resolution method in lat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Intelligence Systems
سال: 2015
ISSN: 1875-6891,1875-6883
DOI: 10.1080/18756891.2015.1129580